Modeling the Branching Characteristics and Efficiency Gains in Global Multicast Trees

نویسندگان

  • Robert C. Chalmers
  • Kevin C. Almeroth
چکیده

In this paper, we investigate two issues. First, what level of efficiency gain does multicast offer over unicast? Second, how does the shape of multicast trees impact multicast efficiency? We address the first issue by developing a metric to measure multicast efficiency for a number of real and synthetic datasets. We find that group sizes as small as 20 to 40 receivers offer a 60-70% reduction in the number of links traversed compared to separately delivered unicast streams. Addressing the second issue, we have found that almost all multicast trees have similar characteristics in terms of key parameters such as depth, degree frequency and average degree. A final contribution of our work is that we have taken multicast group membership data and multicast path data and compiled datasets which can be used to generate large, realistic multicast trees. Keywords—Multicast, measurement, modeling, tree characteristics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling the Branching Characteristics and Efficiency Gains of Global Multicast Trees

In this paper, we investigate two issues. First, what level of efficiency gain does multicast offer over unicast? Second, how does the shape of multicast trees impact multicast efficiency? We address the first issue by developing a metric to measure multicast efficiency for a number of real and synthetic datasets. We find that group sizes as small as 20 to 40 receivers offer a 60-70% reduction ...

متن کامل

Multicast computer network routing using genetic algorithm and ant colony

Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...

متن کامل

SEM: A New Small Group Multicast Routing Protocol

Recently several multicast mechanisms [3], known as small group multicast, were proposed that scale better with the number of multicast sessions than traditional multicast does. In this paper, we propose a new approach, Simple Explicit Multicast (SEM), which uses an efficient method to construct multicast trees and deliver multicast packets. SEM is original because it adopts the source-specific...

متن کامل

An hybrid explicit multicast/recursive unicast approach for multicast routing

In this paper, we propose a new approach, Simple Explicit Multicast (SEM), which uses an efficient method to construct multicast trees and to deliver multicast packets to all destinations. In order to construct a multicast tree, the source encodes the list of destination addresses in a branch message. This message discovers the tree branching routers and creates a multicast routing state in eac...

متن کامل

An Hybrid Explicit Multicast/unicast Recursif Approach for Multicast Routing Ali Boudani and Bernard Cousin

In this paper, we propose a new approach, Simple Explicit Multicast (SEM), which uses an efficient method to construct multicast trees and to deliver multicast packets to all destinations. In order to construct a multicast tree, the source encodes the list of destination addresses in a branch message. This message discovers the tree branching routers and creates a multicast routing state in eac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001